An Inflationary Fixed Point in XQuery
نویسندگان
چکیده
We introduce a controlled form of recursion in XQuery, inflationary fixed points, familiar in the context of relational databases. This imposes restrictions on the expressible types of recursion, but we show that inflationary fixed points nevertheless are sufficiently versatile to capture a wide range of interesting use cases, including the semantics of Regular XPath and its core transitive closure construct. While the optimization of general user-defined recursive functions in XQuery appears elusive, we will describe how inflationary fixed points can be efficiently evaluated, provided that the recursive XQuery expressions exhibit a distributivity property. We show how distributivity can be assessed both, syntactically and algebraically, and provide experimental evidence that XQuery processors can substantially benefit during inflationary fixed point evaluation.
منابع مشابه
Expressive Equivalence of Least and Inflationary Fixed-Point Logic
We study the relationship between least and inflationary fixed-point logic. By results of Gurevich and Shelah from 1986, it has been known that on finite structures both logics have the same expressive power. On infinite structures however, the question whether there is a formula in IFP not equivalent to any LFP-formula was still open. In this paper, we settle the question by showing that both ...
متن کاملMemBeR: A Micro-benchmark Repository for XQuery
XQuery is a feature-rich language with complex semantics. This makes it hard to come up with a benchmark suite which covers all performance-critical features of the language, and at the same time allows one to individually validate XQuery evaluation techniques. This paper presents MemBeR, a micro-benchmark repository, allowing the evaluation of an XQuery implementation with respect to precise e...
متن کاملOn Core XPath with Inflationary Fixed Points
In this report, we prove the undecidability of Core XPath 1.0 (CXP) [6] extended with an Inflationary Fixed Point (IFP) operator. We prove that the satisfiability problem of this language is undecidable. In fact, the fragment of CXP+IFP containing only the self and descendant axes is already undecidable.
متن کاملSemi-Inflationary DATALOG: A declarative database language with procedural features
This paper presents a rule-based database language which extends stratified DATALOG by adding a controlled form of inflationary fixpoint, immersed in a context of classical stratified negation with least fixpoint. The proposed language, called Semi-Inflationary DATALOG (DATALOG for short), smoothly combines the declarative purity of stratified negation with the procedural style of the inflation...
متن کاملA Note on the Relation between Inflationary Fixpoints and Least Fixpoints of Higher Order
Least fixpoints of monotone functions are an important concept in computer science which can be generalised to inflationary fixpoints of arbitrary functions. This raises questions after the expressive power of these two concepts, in particular whether the latter can be expressed as the former in certain circumstances. We show that the inflationary fixpoint of an arbitrary function on a lattice ...
متن کامل